0.00/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.08	% Command    : run_E %s %d THM
0.06/0.26	% Computer : n024.cluster.edu
0.06/0.26	% Model    : x86_64 x86_64
0.06/0.26	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.26	% Memory   : 8042.1875MB
0.06/0.26	% OS       : Linux 3.10.0-693.el7.x86_64
0.06/0.26	% CPULimit   : 960
0.06/0.26	% WCLimit    : 120
0.06/0.26	% DateTime   : Tue Aug  9 05:19:37 EDT 2022
0.06/0.26	% CPUTime    : 
0.10/0.34	Running higher-order on 8 cores theorem proving
0.10/0.34	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.10/0.34	# Version: 3.0pre003-ho
0.10/0.34	# Preprocessing class: HSMSSMSSMLSNHSN.
0.10/0.34	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.34	# Starting new_ho_10_cnf2 with 600s (5) cores
0.10/0.34	# Starting post_as_ho3 with 120s (1) cores
0.10/0.34	# Starting post_as_ho11 with 120s (1) cores
0.10/0.34	# Starting full_lambda_8 with 120s (1) cores
0.10/0.34	# full_lambda_8 with pid 9253 completed with status 0
0.10/0.34	# Result found by full_lambda_8
0.10/0.34	# Preprocessing class: HSMSSMSSMLSNHSN.
0.10/0.34	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.34	# Starting new_ho_10_cnf2 with 600s (5) cores
0.10/0.34	# Starting post_as_ho3 with 120s (1) cores
0.10/0.34	# Starting post_as_ho11 with 120s (1) cores
0.10/0.34	# Starting full_lambda_8 with 120s (1) cores
0.10/0.34	# No SInE strategy applied
0.10/0.34	# Search class: HHHNF-FFSF00-SHSSMFNN
0.10/0.34	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.10/0.34	# Starting new_ho_10 with 65s (1) cores
0.10/0.34	# new_ho_10 with pid 9257 completed with status 0
0.10/0.34	# Result found by new_ho_10
0.10/0.34	# Preprocessing class: HSMSSMSSMLSNHSN.
0.10/0.34	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.34	# Starting new_ho_10_cnf2 with 600s (5) cores
0.10/0.34	# Starting post_as_ho3 with 120s (1) cores
0.10/0.34	# Starting post_as_ho11 with 120s (1) cores
0.10/0.34	# Starting full_lambda_8 with 120s (1) cores
0.10/0.34	# No SInE strategy applied
0.10/0.34	# Search class: HHHNF-FFSF00-SHSSMFNN
0.10/0.34	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.10/0.34	# Starting new_ho_10 with 65s (1) cores
0.10/0.34	# Preprocessing time       : 0.001 s
0.10/0.34	# Presaturation interreduction done
0.10/0.34	
0.10/0.34	# Proof found!
0.10/0.34	# SZS status Theorem
0.10/0.34	# SZS output start CNFRefutation
0.10/0.34	thf(decl_22, type, in: $i > ($i > $o) > $o).
0.10/0.34	thf(decl_23, type, is_a: $i > ($i > $o) > $o).
0.10/0.34	thf(decl_24, type, emptyset: $i > $o).
0.10/0.34	thf(decl_25, type, unord_pair: $i > $i > $i > $o).
0.10/0.34	thf(decl_26, type, singleton: $i > $i > $o).
0.10/0.34	thf(decl_27, type, union: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.34	thf(decl_28, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.34	thf(decl_29, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.34	thf(decl_30, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.34	thf(decl_31, type, complement: ($i > $o) > $i > $o).
0.10/0.34	thf(decl_32, type, disjoint: ($i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_33, type, subset: ($i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_34, type, meets: ($i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_35, type, misses: ($i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_36, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_37, type, pair_rel: $i > $i > $i > $i > $o).
0.10/0.34	thf(decl_38, type, id_rel: ($i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_39, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o).
0.10/0.34	thf(decl_40, type, is_rel_on: ($i > $i > $o) > ($i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_41, type, restrict_rel_domain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_42, type, rel_diagonal: $i > $i > $o).
0.10/0.34	thf(decl_43, type, rel_composition: ($i > $i > $o) > ($i > $i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_44, type, reflexive: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_45, type, irreflexive: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_46, type, symmetric: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_47, type, transitive: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_48, type, equiv_rel: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_49, type, rel_codomain: ($i > $i > $o) > $i > $o).
0.10/0.34	thf(decl_50, type, rel_domain: ($i > $i > $o) > $i > $o).
0.10/0.34	thf(decl_51, type, rel_inverse: ($i > $i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_52, type, equiv_classes: ($i > $i > $o) > ($i > $o) > $o).
0.10/0.34	thf(decl_53, type, restrict_rel_codomain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
0.10/0.34	thf(decl_54, type, rel_field: ($i > $i > $o) > $i > $o).
0.10/0.34	thf(decl_55, type, well_founded: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_56, type, upwards_well_founded: ($i > $i > $o) > $o).
0.10/0.34	thf(decl_57, type, epred1_0: $i > $o).
0.10/0.34	thf(decl_58, type, epred2_0: $i > $i > $o).
0.10/0.34	thf(decl_59, type, epred3_0: $i > $o).
0.10/0.34	thf(decl_60, type, epred4_0: $i > $o).
0.10/0.34	thf(decl_61, type, esk1_0: $i).
0.10/0.34	thf(decl_62, type, esk2_0: $i).
0.10/0.34	thf(is_rel_on, axiom, ((is_rel_on)=(^[X28:$i > $i > $o, X29:$i > $o, X30:$i > $o]:(![X1:$i, X3:$i]:(((X28 @ X1 @ X3)=>((X29 @ X1)&(X30 @ X3))))))), file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax', is_rel_on)).
0.10/0.34	thf(restrict_rel_codomain, axiom, ((restrict_rel_codomain)=(^[X28:$i > $i > $o, X25:$i > $o, X1:$i, X3:$i]:(((X25 @ X3)&(X28 @ X1 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax', restrict_rel_codomain)).
0.10/0.34	thf(thm, conjecture, ![X36:$i > $o, X28:$i > $i > $o, X37:$i > $o, X38:$i > $o]:(((is_rel_on @ (restrict_rel_codomain @ X28 @ X36) @ X37 @ X36)<=(is_rel_on @ X28 @ X37 @ X38))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)).
0.10/0.34	thf(c_0_3, plain, ((is_rel_on)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i > $o]:(![X1:$i, X3:$i]:(((Z0 @ X1 @ X3)=>((Z1 @ X1)&(Z2 @ X3))))))), inference(fof_simplification,[status(thm)],[is_rel_on])).
0.10/0.34	thf(c_0_4, plain, ((restrict_rel_codomain)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i, Z3:$i]:(((Z1 @ Z3)&(Z0 @ Z2 @ Z3))))), inference(fof_simplification,[status(thm)],[restrict_rel_codomain])).
0.10/0.34	thf(c_0_5, negated_conjecture, ~(![X36:$i > $o, X28:$i > $i > $o, X37:$i > $o, X38:$i > $o]:((![X53:$i, X54:$i]:(((X28 @ X53 @ X54)=>((X37 @ X53)&(X38 @ X54))))=>![X51:$i, X52:$i]:((((X36 @ X52)&(X28 @ X51 @ X52))=>((X37 @ X51)&(X36 @ X52))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_3]), c_0_4])])).
0.10/0.34	thf(c_0_6, negated_conjecture, ![X59:$i, X60:$i]:(((((epred3_0 @ X59)|~(epred2_0 @ X59 @ X60))&((epred4_0 @ X60)|~(epred2_0 @ X59 @ X60)))&(((epred1_0 @ esk2_0)&(epred2_0 @ esk1_0 @ esk2_0))&(~(epred3_0 @ esk1_0)|~(epred1_0 @ esk2_0))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.10/0.34	thf(c_0_7, negated_conjecture, (~((epred3_0 @ esk1_0))|~((epred1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.10/0.34	thf(c_0_8, negated_conjecture, (epred1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_6])).
0.10/0.34	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i]:(((epred3_0 @ X1)|~((epred2_0 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.10/0.34	thf(c_0_10, negated_conjecture, (epred2_0 @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_6])).
0.10/0.34	thf(c_0_11, negated_conjecture, ~((epred3_0 @ esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
0.10/0.34	thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']).
0.10/0.34	# SZS output end CNFRefutation
0.10/0.34	# Parsed axioms                        : 71
0.10/0.34	# Removed by relevancy pruning/SinE    : 0
0.10/0.34	# Initial clauses                      : 40
0.10/0.34	# Removed in clause preprocessing      : 35
0.10/0.34	# Initial clauses in saturation        : 5
0.10/0.34	# Processed clauses                    : 9
0.10/0.34	# ...of these trivial                  : 0
0.10/0.34	# ...subsumed                          : 0
0.10/0.34	# ...remaining for further processing  : 9
0.10/0.34	# Other redundant clauses eliminated   : 0
0.10/0.34	# Clauses deleted for lack of memory   : 0
0.10/0.34	# Backward-subsumed                    : 0
0.10/0.34	# Backward-rewritten                   : 0
0.10/0.34	# Generated clauses                    : 1
0.10/0.34	# ...of the previous two non-redundant : 0
0.10/0.34	# ...aggressively subsumed             : 0
0.10/0.34	# Contextual simplify-reflections      : 0
0.10/0.34	# Paramodulations                      : 1
0.10/0.34	# Factorizations                       : 0
0.10/0.34	# NegExts                              : 0
0.10/0.34	# Equation resolutions                 : 0
0.10/0.34	# Propositional unsat checks           : 0
0.10/0.34	#    Propositional check models        : 0
0.10/0.34	#    Propositional check unsatisfiable : 0
0.10/0.34	#    Propositional clauses             : 0
0.10/0.34	#    Propositional clauses after purity: 0
0.10/0.34	#    Propositional unsat core size     : 0
0.10/0.34	#    Propositional preprocessing time  : 0.000
0.10/0.34	#    Propositional encoding time       : 0.000
0.10/0.34	#    Propositional solver time         : 0.000
0.10/0.34	#    Success case prop preproc time    : 0.000
0.10/0.34	#    Success case prop encoding time   : 0.000
0.10/0.34	#    Success case prop solver time     : 0.000
0.10/0.34	# Current number of processed clauses  : 4
0.10/0.34	#    Positive orientable unit clauses  : 2
0.10/0.34	#    Positive unorientable unit clauses: 0
0.10/0.34	#    Negative unit clauses             : 1
0.10/0.34	#    Non-unit-clauses                  : 1
0.10/0.34	# Current number of unprocessed clauses: 1
0.10/0.34	# ...number of literals in the above   : 2
0.10/0.34	# Current number of archived formulas  : 0
0.10/0.34	# Current number of archived clauses   : 5
0.10/0.34	# Clause-clause subsumption calls (NU) : 0
0.10/0.34	# Rec. Clause-clause subsumption calls : 0
0.10/0.34	# Non-unit clause-clause subsumptions  : 0
0.10/0.34	# Unit Clause-clause subsumption calls : 0
0.10/0.34	# Rewrite failures with RHS unbound    : 0
0.10/0.34	# BW rewrite match attempts            : 0
0.10/0.34	# BW rewrite match successes           : 0
0.10/0.34	# Condensation attempts                : 9
0.10/0.34	# Condensation successes               : 0
0.10/0.34	# Termbank termtop insertions          : 1955
0.10/0.34	
0.10/0.34	# -------------------------------------------------
0.10/0.34	# User time                : 0.002 s
0.10/0.34	# System time              : 0.001 s
0.10/0.34	# Total time               : 0.004 s
0.10/0.34	# Maximum resident set size: 1912 pages
0.10/0.34	
0.10/0.34	# -------------------------------------------------
0.10/0.34	# User time                : 0.003 s
0.10/0.34	# System time              : 0.002 s
0.10/0.34	# Total time               : 0.006 s
0.10/0.34	# Maximum resident set size: 1808 pages
0.10/0.34	EOF